A generalization of the Solis–Wets method
نویسنده
چکیده
In this paper we focus on the application of global stochastic optimization methods to extremum estimators. We propose a general stochastic method—the master method —which includes several stochastic optimization algorithms as a particular case. The proposed method is sufficiently general to include the Solis–Wets method, the improving hit-and-run algorithm, and a stochastic version of the zigzag algorithm. A matrix formulation of the master method is presented and some specific results are given for the stochastic zigzag algorithm. Convergence of the proposed method is established under a mild set of conditions, and a simple regression model is used to illustrate the method. & 2011 Elsevier B.V. All rights reserved.
منابع مشابه
Memetic algorithms based on local search chains for large scale continuous optimisation problems: MA-SSW-Chains
Nowadays, large scale optimisation problems arise as a very interesting field of research, because they appear in many real-world problems (bio-computing, data mining, etc.). Thus, scalability becomes an essential requirement for modern optimisation algorithms. In a previous work, we presented memetic algorithms based on local search chains. Local search chain concerns the idea that, at one sta...
متن کاملCalibration of Microscopic Traffic Flow Simulation Models Using a Memetic Algorithm with Solis and Wets Local Search Chaining (MA-SW-Chains)
Traffic models require calibration to provide an adequate representation of the actual field conditions. This study presents the adaptation of a memetic algorithm (MA-SW-Chains) based on Solis and Wets local search chains, for the calibration of microscopic traffic flow simulation models. The effectiveness of the proposed MA-SW-Chains approach was tested using two vehicular traffic flow models ...
متن کاملSolis Graphs and Uniquely Metric Basis Graphs
A set $Wsubset V (G)$ is called a resolving set, if for every two distinct vertices $u, v in V (G)$ there exists $win W$ such that $d(u,w) not = d(v,w)$, where $d(x, y)$ is the distance between the vertices $x$ and $y$. A resolving set for $G$ with minimum cardinality is called a metric basis. A graph with a unique metric basis is called a uniquely dimensional graph. In this paper, we establish...
متن کاملA memetic GSA with niching selection for training fuzzy wavelet neural network
This paper proposes an effective memetic Gravitational Search Algorithm (GSA) that utilizes Solis and Wets’ (SW) algorithm as local search. GSA has good exploration ability and SW helps to improve the exploitation ability of the memetic algorithm. Furthermore, a selection strategy is proposed to select suitable individuals for local refinement that is based on subtractive clustering. Proposed m...
متن کاملContinuous scatter search: An analysis of the integration of some combination methods and improvement strategies
Scatter search is an evolutionary method that shares with genetic algorithms, a well-known evolutionary approach, the employment of a combination method that combines the features of two parent vectors to form several offspring. Furthermore, it uses improvement strategies to efficiently produce the local tuning of the solutions. An important aspect concerning scatter search is the trade-off bet...
متن کامل